Tight sign-central matrices

نویسندگان

  • Suk-Geun Hwang
  • Xiao-Dong Zhang
چکیده

A real matrix A is called sign-central if the convex hull of the columns of à contains the zero vector 0 for every matrix à with the same sign pattern as A. A sign-central matrix A is called a minimal sign-central matrix if the deletion of any of the columns of A breaks the signcentrality of A. A sign-central matrix A is called tight sign-central if the Hadamard (entrywise) product of any two columns of A contains a negative component. In this paper, we show that every tight sign-central matrix is minimal sign-central and characterize the tight sign-central matrices. We also determine the lower bound of the number of columns of a tight sign-central matrix in terms of the number of rows and the number of zero entries of the matrix. © 2003 Elsevier Inc. All rights reserved. AMS classification: 15A99

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

متن کامل

PERRON-FROBENIUS THEORY ON THE NUMERICAL RANGE FOR SOME CLASSES OF REAL MATRICES

We give further results for Perron-Frobenius theory on the numericalrange of real matrices and some other results generalized from nonnegative matricesto real matrices. We indicate two techniques for establishing the main theorem ofPerron and Frobenius on the numerical range. In the rst method, we use acorresponding version of Wielandt's lemma. The second technique involves graphtheory.

متن کامل

Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions

We study the problems of sorting signed permutations by reversals (SBR) and sorting unsigned permutations by transpositions (SBT), which are central problems in computational molecular biology. While a polynomial-time solution for SBR is known, the computational complexity of SBT has been open for more than a decade and is considered a major open problem. In the first efficient solution of SBR,...

متن کامل

Properties of Central Symmetric X-Form Matrices

In this paper we introduce a special form of symmetric matrices that is called central symmetric $X$-form matrix and study some properties, the inverse eigenvalue problem and inverse singular value problem for these matrices.

متن کامل

A Method for Determining the Regularity Radius of Interval Matrices

Determination of the regularity radius r∗ of interval matrices is known to be a NP-hard problem. In this paper, a method for determining r∗ is suggested whose numerical complexity is not a priori exponential. The method is based on an equivalent transformation of the original problem to the problem of determining the real maximum magnitude eigenvalue μ∗ of an associated interval generalized eig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003